Turing and the Art of Classical Computability
نویسنده
چکیده
1. Mathematics as an Art Mathematics is an art as well as a science. It is an art in the sense of a skill as in Donald Knuth’s series, The Art of Computer Programming, but it is also an art in the sense of an esthetic endeavor with inherent beauty which is recognized by all mathematicians. One of the world’s leading art treasures is Michelangelo’s statue of David as a young man displayed in the Accademia Gallery in Florence. There is a long aisle to approach the statue of David. The aisle is flanked by the statues of Michelangelo’s unfinished slaves struggling as if to emerge from the blocks of marble. These figures reveal Michelangelo’s work process. There are practically no details, and yet they possess a weight and power beyond their physical proportions. Michelangelo thought of himself not as
منابع مشابه
Some improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملAn Introduction to Computability Theory
This paper will give an introduction to the fundamentals of computability theory. Based on Robert Soare’s textbook, The Art of Turing Computability: Theory and Applications, we examine concepts including the Halting problem, properties of Turing jumps and degrees, and Post’s Theorem. In the paper, we will assume the reader has a conceptual understanding of computer programs.
متن کاملThe Computational Power of Continuous Dynamic Systems
In this paper we show how to explore the classical theory of computability using the tools of Analysis: a differential scheme is substituted for the classical recurrence scheme and a limit operator is substituted for the classical minimalization. We show that most relevant problems of computability over the non negative integers can be dealt with over the reals: elementary functions are computa...
متن کاملOrdinal Computability
Ordinal computability uses ordinals instead of natural numbers in abstract machines like register or Turing machines. We give an overview of the computational strengths of α-β-machines, where α and β bound the time axis and the space axis of some machine model. The spectrum ranges from classical Turing computability to ∞-∞-computability which corresponds to Gödel’s model of constructible sets. ...
متن کاملHypercomputation: Towards an extension of the classical notion of Computability?
The purpose of this thesis is to make an analysis of the concept of Hypercomputation and of some hypermachines. This thesis is separated in three main parts. We start in the first chapter with an analysis of the concept of Classical Computability with the Turing Machine and the Church-Turing thesis as a main reference and afterwards, in the second chapter, we continue with an analysis of hyperc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011